Cosmic logic: a computational model

A Computational Model of Logic-Based Negotiation

This paper presents a computational model of negotiation based on Nebel’s syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining game without using lotteries. Its game-theoretic properties are discussed against the existence and uniqueness of Nash equilibrium and subgame perfect equilibrium. We also study essential computational properties in relatio...

A computational logic

A computational model for conceptual design based on function logic

Function logic and function block diagrams have been successfully employed in preliminary and conceptual design processes for several decades. This paper describes a computational model of this process with extensions of the manual approach. It provides for a systematic identification and definition of form and function variables and identifies a three-level function/allocation/component inform...

Teaching Functional and Logic Programming with a Single Computational Model

Functional and logic programming are often taught in different courses so that students often do not understand the relationships between these declarative programming paradigms. This is mainly due to the different underlying computation models—deterministic reduction and lazy evaluation in functional languages, and non-deterministic search in logic languages. We show in this paper that this ne...

A rewrite-based computational model for functional logic programming

Functional logic programming extends the functional programming style with two important features: the possibility to define nondeterministic operations with overlapping rules, and the usage of logic variables in both defining rules and expressions to evaluate. Conditional constructor-based term rewrite systems (CB-CTRSs) emerged as a suitable model for functional logic programs, because they c...